Efficient Resource Matching in Heterogeneous Grid Using Resource Vector
نویسندگان
چکیده
In this paper, a method for efficient scheduling to obtain optimum job throughput in a distributed campus grid environment is presented; Traditional job schedulers determine job scheduling using user and job resource attributes. User attributes are related to current usage, historical usage, user priority and project access. Job resource attributes mainly comprise of soft requirements (compilers, libraries) and hard requirements like memory, storage and interconnect. A job scheduler dispatches jobs to a resource if a job’s hard and soft requirements are met by a resource. In current scenario during execution of a job, if a resource becomes unavailable, schedulers are presented with limited options, namely re-queuing job or migrating job to a different resource. Both options are expensive in terms of data and compute time. These situations can be avoided, if the often ignored factor, availability time of a resource in a grid environment is considered. We propose resource rank approach, in which jobs are dispatched to a resource which has the highest rank among all resources that match the job’s requirement. The results show that our approach can increase throughput of many serial / monolithic jobs.
منابع مشابه
Weighted-HR: An Improved Hierarchical Grid Resource Discovery
Grid computing environments include heterogeneous resources shared by a large number of computers to handle the data and process intensive applications. In these environments, the required resources must be accessible for Grid applications on demand, which makes the resource discovery as a critical service. In recent years, various techniques are proposed to index and discover the Grid resource...
متن کاملOn-line Resource Matching in a Heterogeneous Grid Environment
In this paper, we first present a linear programming based approach for modeling and solving the resource matching problem in grid environments with heterogeneous resources. The resource matching problem described here takes into account resource sharing, job priorities, dependencies on multiple resource types, and resource specific policies. We then propose a web service style architecture for...
متن کاملA Comparative Study on Seven Static Mapping Heuristics for Grid Scheduling Problem
Grid computing is a promising technology for future computing platforms and is expected to provide easier access to remote computational resources that are usually locally limited. Scheduling is one of the core steps to efficiently exploit the capabilities of grid computing (GC) systems. The problem of optimally mapping (defined as matching and scheduling) tasks onto the machines of a grid comp...
متن کاملDesign and implementation of economics-based resource management system in ad hoc grid
The ad hoc grid is a spontaneous organization of cooperating heterogeneous nodes into a logical community without a fixed infrastructure and with only minimal administrative requirements. Resource management for ad hoc grids is challenging due to the participation of heterogeneous, dynamic, autonomous and ephemeral grid nodes. The paper proposes an ad hoc grid resource management system, the pr...
متن کاملResource and Application Models for Advanced Grid Schedulers
As Grid computing is becoming an inevitable future, managing, scheduling and monitoring dynamic, heterogeneous resources will present new challenges. Solutions will have to be agile and adaptive, support self-organization and autonomous management, while maintaining optimal resource utilisation. Presented in this paper are basic principles and architectural concepts for efficient resource alloc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1006.1177 شماره
صفحات -
تاریخ انتشار 2010